منابع مشابه
Patent Citation Cycles
A BASIC DESCRIPTION OF PATENT CITATION cycles is provided for 1,100 major companies and organizations covered by the TECH-LINEsM database. The average U.S. patent has five to six “references citedU.S. patent documents.” The properties of these patent citations are shown to vary widely from one technology to another. For example, patents in Office Computing and Accounting, a relatively hot area,...
متن کاملUnstructured peer-to-peer networks for sharing processor cycles
Motivated by the needs and success ofprojects such as SETI@llOme and genome@home, we propose an architecturefor a sustainable large-scale peer-to-peer environment for distributed cycle sharing among Internet hosts. Such networks are characterized by highly dynamic state due to high arrival and departure rates. This makes it difficult to build and maintain structured networks and to use statebas...
متن کاملIndependent cycles and chorded cycles in graphs
In this paper, we investigate sufficient conditions on the neighborhood of independent vertices which imply that a graph contains k independent cycles or chorded cycles. This is related to several results of Corrádi and Hajnal, Justesen, Wang, and Faudree and Gould on graphs containing k independent cycles, and Finkel on graphs containing k chorded cycles. In particular, we establish that if in...
متن کاملDisjoint Cycles and Chorded Cycles in Graphs
Very recently, Bialostocki et al. proposed the following conjecture. Let r, s be two nonnegative integers and let G = (V (G), E(G)) be a graph with |V (G)| ≥ 3r + 4s and minimum degree δ(G) ≥ 2r + 3s. Then G contains a collection of r cycles and s chorded cycles, all vertex-disjoint. We prove that this conjecture is true.
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientometrics
سال: 1997
ISSN: 0138-9130,1588-2861
DOI: 10.1007/bf02461122